Universal data compression and repetition times

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal data compression and repetition times

A new universal data compression algorithm is described. + 1)1)/L bits per source symbol. In our analysis, a property of repetition times turns out to be of crucial importance.

متن کامل

Universal lossless data compression algorithms

4 Improved compression algorithm based on the Burrows–Wheeler transform 61 4.1 Modifications of the basic version of the compression algorithm. 61 5 Conclusions 141 iii Acknowledgements 145 Bibliography 147 Appendices 161 A Silesia corpus 163 B Implementation details 167 C Detailed options of examined compression programs 173 D Illustration of the properties of the weight functions 177 E Detail...

متن کامل

A universal data compression system

Trans. Inform. Theory, vol. IT-23, pp. 343-353, May 1977. [4] H. H. Tan, “Tree encoding of discrete-time abstract-alphabet stationary block-ergodic sources with a fidelity criterion,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 671-681, Nov. 1976. [5] R. M. Gray, D. L. Net&off, and J. K. Omura, “Process definition of distortion-rate functions and source coding theorems,” IEEE Trans. Inform. The...

متن کامل

Universal Data Compression and Linear Prediction

The relationship between prediction and data compression can be extended to universal prediction schemes and universal data compression. Recent work shows that minimizing the sequential squared prediction error for individual sequences can be achieved using the same strategies which minimize the sequential codelength for data compression of individual sequences. De ning a \probability" as an ex...

متن کامل

Universal True Lossless Combinatorial Data Compression

Contemporary approaches to data compression vary in time delay or impact on application performance as well as in the amount of compression and loss of data. The very best modern lossless data compression algorithms use standard approaches and are unable to match spacetime high end requirements for mission critical application, with full information conservation (a few pixels may vary by com/de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 1989

ISSN: 0018-9448

DOI: 10.1109/18.42176